MACBeth: A Multi-Agent Constraint-Based Planner

نویسندگان

  • Robert P. Goldman
  • Karen Zita Haigh
  • David J. Musliner
  • Michael Pelican
چکیده

MACBETH is a constraint-based tactical planning engine for multi-agent teams. MACBETH is designed for domains in which a human user must quickly specify a mission to a team of autonomous agents. In these domains, "puzzle-mode" thinking to come up with novel plans is not important; the key task is to rapidly and accurately tailor existing plans to novel situations. To this end, MACBETH combines hierarchical task network planning with modern constraint reasoning techniques, into a mixed-initiative planning system. This mixed-initiative planning system is driven by a graphical user interface inspired by a "playbook" metaphor, to generate, check and modify plans for teams of heterogeneous agents. MACBETH has been tested in two robotics domains: Unmanned Combat Aerial Vehicles (UCAV) sorties and Tactical Mobile Robotics (TMR). MACBETH is designed for domains in which a human user must quickly, specify a mission to a team of autonomous agents. To do this, the user must be able to simply and easily specify a high-level "play" for the team to perform. The user must, however, be able to tailor this plan; completely automatic planning is not acceptable. In every tactical planning scenario, the human user brings context information to the planning process that is not directly available to the automation. For example, in the UCAV domain, the wing commander must identify the objective of the sortie. In some cases, the commander may want to add further restrictions on the behavior of the UCAVs. For example, he might indicate that the UCAV should circumnavigate airspace belonging to a noncombatant nation, or select a different attack formation based on his own skills and preferences. In tactical applications, the mission planning system must ensure that plans are feasible. An attempt by the user to specify an infeasible plan should be flagged by the planning algorithm as soon as possible, so that she can retract a decision or reconcile conflicting objectives early in the planning process. For example, in a UCAV domain, the commander might initially assign two widely separated reconnaissance targets to a single UCAV with insufficient fuel to reach both locations. The planner should identify the inconsistency quickly, ideallybefore it expands planning effort on plan details, such as determining final approach routes for the two targets, and immediately alert the user that she may need to modify her objectives or the allocation of her resources.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Risk Allocation for Multi-agent Systems using Tˆ¢tonnement

This paper proposes a new market-based distributed planning algorithm for multi-agent systems under uncertainty, called MIRA (Marketbased Iterative Risk Allocation). In large coordination problems, from power grid management to multi-vehicle missions, multiple agents act collectively in order to optimize the performance of the system, while satisfying mission constraints. These optimal plans ar...

متن کامل

k-Robust Multi-Agent Path Finding

This paper presents a planner that can solve the k-robust MAPF planner which is based on the Conflict-based search (CBS) (Sharon et al. 2015) MAPF solver. CBS does not explicitly search the n-agent state space. Instead, agents are associated with constraints of the form 〈ai, v, t〉, which would prohibit agent ai from occupying vertex v at time step t. A consistent path for agent ai is a path tha...

متن کامل

Distributed Scheduling Using Constraint Optimization and Multiagent Path Planning

The goal of the distributed scheduling problem is to minimize the global cost of assigning n decentralized workers to m tasks at time points. This problem is further complicated in continuous environments because the entire state space cannot be searched. This paper presents a decentralized approach of dividing the distributed scheduling in continuous environments problem into two subproblems: ...

متن کامل

Visual Appearance Mapping for Optimal Vision Based Servoing

Pure appearance based visual maps can be constructed without considering any 3–D spatial information, nevertheless they can be used for robot localization and navigation. This paper proposes a topological framework capable of coordinate multi-agent navigation through an appearance based topological map using only grabbed images as sensory data. The main focus of the paper is on the navigation a...

متن کامل

Nature-Inspired Planner Agent for Health Care

This paper presents an autonomous intelligent agent with a human thinking reasoning model, based on past experiences. The agent is developed to assist medical staff in geriatric residences. The health care process is a vital function, requiring nature-inspired solutions imitating the residence staff behaviours. An autonomous deliberative Case-Based Planner agent, AGALZ (Autonomous aGent for mon...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000